Shortening Grover’s Search Algorithm for an Expectation Value Quantum Computer
نویسنده
چکیده
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value implementations of quantum algorithms has been to retain the conventional formulation’s unitary operations but modify its initialization and measurement steps appropriately. This naive approach is not optimal for Grover’s algorithm and a shortened version for expectation value quantum computers is presented.
منابع مشابه
Quantum Searching: A survey of Grover’s Algorithm and its Descendants
One of computer science’s classic problems is that of the search. This paper will look at Lou K. Grover’s Quantum Search algorithm. This algorithm is used to search a database, or search space, that is not, and cannot be, sorted or structured. It can produce a quadratic speed up over any similar classical search. This paper will also look at some of the issues and advances that have come out of...
متن کاملSimulation of Grover’s quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
We implement Grover’s quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity...
متن کاملArbitrary Phase Rotation of the Marked State Can not Be Used for Grover’s Quantum Search Algorithm
A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation in Grover’s search algorithm can be used to construct a (less efficient) quantum search algorithm is cleared. The π rotation of the phase of the marked state is not only the choice for efficiency, but also vital in Grover’s quantum search algorithm. The results also show t...
متن کاملAn Intuitive Hamiltonian for Quantum Search
We present new intuition behind Grover’s quantum search algorithm by means of a Hamiltonian. Given a black-box Boolean function f : {0, 1}n → {0, 1} such that f(w) = 1 for exactly one w ∈ {0, 1}n, Grover [4] describes a quantum algorithm that finds w in O(2) time. Farhi & Gutmann [3] show that w can also be found in the same amount time by letting the quantum system evolve according to a simple...
متن کاملThe Algorithm on a Quantum Computer with Power Queries
In this summary we discuss two new algorithms for Grover’s unsorted database search problem that claimed to have reached exponential speedup over Grover’s original algorithm. One is in the quantum setting with “power queries” that allow for exponential reduction in the number of queries over Grover’s original algorithm with “bit queries”. The other is to use “dubit queries” on a duality compute...
متن کامل